A Semantic Method to Information Extraction for Decision Support Systems

In this paper, we describe a novel schema for a more semantic text mining process which results in more comprehensive decision making activity by decision support systems via providing more effective and accurate textual information. The utility of two semantic lexical resources; Frame Net and Word Net, in extracting required text snippets from unstructured free texts yields a better and more accurate information extraction process to deliver more precise information either to a DSS or to a decision maker. We explain how the usage of these lexical resources could elevate a focused text mining process which could be applied to an information provider system in a decision support paradigm. The preliminary results obtained after a starter experiment show that the hybrid information extraction schema performs well on some semantic failure situations

Enhancing factoid question answering using frame semantic-based approaches

FrameNet is used to enhance the performance of semantic QA systems. FrameNet is a linguistic resource that encapsulates Frame Semantics and provides scenario-based generalizations over lexical items that share similar semantic backgrounds.Doctor of Philosoph

Detecting phishing emails using hybrid features

Phishing emails have been used widely in fraud of financial organizations and customers. Phishing email detection has drawn a lot attention for many researchers and malicious detection devices are installed in email servers. However, phishing has become more and more complicated and sophisticated and attack can bypass the filter set by anti-phishing techniques. In this paper, we present a method to build a robust classifier to detect phishing emails using hybrid features and to select features using information gain. We experiment on 10 cross-validations to build an initial classifier which performs well. The experiment also analyses the quality of each feature using information gain and best feature set is selected after a recursive learning process. Experimental result shows the selected features perform as well as the original features. Finally, we test five machine learning algorithms and compare the performance of each. The result shows that decision tree builds the best classifier

The elimination race in track cycling : patterns and predictors of performance

The track cycling Omnium is a multi-event competition that has recently been expanded to include the Elimination Race (ER), which presents a unique set of physical and tactical demands. The purpose of this research was to characterise the performance attributes of successful and unsuccessful cyclists in the ER, that are also predictive of performance. Video recordings of four international level ERs were analysed. The performance attributes measured related to the cyclists’ velocity and two dimensional position in the peloton. The average velocity of the peloton up to lap 30 (of 50) was relatively high and consistent (52.2±1.5 km/h). After lap 30, there was a significant (p<0.001) change in velocity (49.9±2.4 km/h), characterised by more fluctuations in lap-to-lap velocity. Successful ER cyclists adopted a tactic of remaining in the middle of the peloton, in the lower lanes of the velodrome, thus avoiding the risk of elimination at the rear and the extra effort required to remain on the front of the peloton. Unsuccessful cyclists tended to reside in the rear and upper (higher) portions of the peloton, risking elimination more often and having to ride faster than those in the lower lanes of the velodrome. The physiological demands of the Elimination Race that are determined by velocity, vary throughout the Elimination Race and the pattern of movement within the peloton is different for successful and unsuccessful cyclists. The findings of the present study may confirm some aspects of race tactics that are currently thought to be optimal, but they also reveal novel information that is useful to coaches and cyclists who compete in the Elimination Race

Learning parse-free event-based features for textual entailment recognition

We propose new parse-free event-based features to be used in conjunction with lexical, syntactic, and semantic features of texts and hypotheses for Machine Learning-based Recognizing Textual Entailment. Our new similarity features are extracted without using shallow semantic parsers, but still lexical and compositional semantics are not left out. Our experimental results demonstrate that these features can improve the effectiveness of the identification of entailment and no-entailment relationships. © 2010 Springer-Verlag

Learning parse-free event-based features for textual entailment recognition

We propose new parse-free event-based features to be used in conjunction with lexical, syntactic, and semantic features of texts and hypotheses for Machine Learning-based Recognizing Textual Entailment. Our new similarity features are extracted without using shallow semantic parsers, but still lexical and compositional semantics are not left out. Our experimental results demonstrate that these features can improve the effectiveness of the identification of entailment and no-entailment relationships. © 2010 Springer-Verlag